Trajectory Planning With Deep Reinforcement Learning in High-Level Action Spaces

نویسندگان

چکیده

This article presents a technique for trajectory planning based on parameterized high-level actions. These actions are subtrajectories that have variable shape and duration. The use of can improve the performance guidance algorithms. Specifically, we show how improves policies generated via reinforcement learning (RL). RL has shown great promise solving complex control, guidance, coordination problems but still suffer from long training times poor performance. work shows reduces required number steps increases path an RL-trained policy. We demonstrate method space-shuttle example. proposed (latitude range) by 18% compared with baseline implementation. Similarly, achieves steady state during approximately 75% fewer steps. also policy enables effective in obstacle field. Finally, this develops loss function term policy-gradient-based deep RL, which is analogous to antiwindup mechanism feedback control. inclusion underlying optimization average return our numerical

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Reinforcement Learning in Continuous Action Spaces

A new fast algorithm for reinforcement learning (RL) in continuous state and action spaces is proposed. Unlike algorithms based on dynamic programming, the proposed algorithm uses neither temporal nor spatial diierencing. Instead, it couples the solution of the Hamilton-Jacobi-Bellman (HJB) partial diierential equation with the structure of the function approximators that are commonly used toge...

متن کامل

Reinforcement Learning in Large Discrete Action Spaces

Being able to reason in an environment with a large number of discrete actions is essential to bringing reinforcement learning to a larger class of problems. Recommender systems, industrial plants and language models are only some of the many real-world tasks involving large numbers of discrete actions for which current methods can be difficult or even impossible to apply. An ability to general...

متن کامل

Deep Reinforcement Learning in Parameterized Action Space

Recent work has shown that deep neural networks are capable of approximating both value functions and policies in reinforcement learning domains featuring continuous state and action spaces. However, to the best of our knowledge no previous work has succeeded at using deep neural networks in structured (parameterized) continuous action spaces. To fill this gap, this paper focuses on learning wi...

متن کامل

Mulitagent Reinforcement Learning in Stochastic Games with Continuous Action Spaces

We investigate the learning problem in stochastic games with continuous action spaces. We focus on repeated normal form games, and discuss issues in modelling mixed strategies and adapting learning algorithms in finite-action games to the continuous-action domain. We applied variable resolution techniques to two simple multi-agent reinforcement learning algorithms PHC and MinimaxQ. Preliminary ...

متن کامل

Action Branching Architectures for Deep Reinforcement Learning

Discrete-action algorithms have been central to numerous recent successes of deep reinforcement learning. However, applying these algorithms to high-dimensional action tasks requires tackling the combinatorial increase of the number of possible actions with the number of action dimensions. This problem is further exacerbated for continuous-action tasks that require fine control of actions via d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems

سال: 2023

ISSN: ['1557-9603', '0018-9251', '2371-9877']

DOI: https://doi.org/10.1109/taes.2022.3218496